Combinatorial optimization

Results: 1158



#Item
61Algorithms and Data Structures Winter TermExercises for Units 37 & 38 1. For stable matching with incomplete lists, each man x ∈ X has a strict list x over a subset of the women Y, i.e., x is possibly incomp

Algorithms and Data Structures Winter TermExercises for Units 37 & 38 1. For stable matching with incomplete lists, each man x ∈ X has a strict list x over a subset of the women Y, i.e., x is possibly incomp

Add to Reading List

Source URL: www-tcs.cs.uni-sb.de

Language: English - Date: 2016-03-30 16:37:02
62Algorithms and Data Structures Winter TermExercises for Units 25 & 26 1. Suppose you are given a directed graph G = (V, E), two vertices s and t, a capacity function c : E → R+ , and another function f : E →

Algorithms and Data Structures Winter TermExercises for Units 25 & 26 1. Suppose you are given a directed graph G = (V, E), two vertices s and t, a capacity function c : E → R+ , and another function f : E →

Add to Reading List

Source URL: www-tcs.cs.uni-sb.de

Language: English - Date: 2016-03-17 15:32:23
63Rumor Spreading with Bounded In-Degree∗ Sebastian Daum, Fabian Kuhn, and Yannic Maus Deptartment of Computer Science, University of FreiburgFreiburg, Germany , {kuhn, yannic.maus}@cs.uni-

Rumor Spreading with Bounded In-Degree∗ Sebastian Daum, Fabian Kuhn, and Yannic Maus Deptartment of Computer Science, University of FreiburgFreiburg, Germany , {kuhn, yannic.maus}@cs.uni-

Add to Reading List

Source URL: sirocco2016.hiit.fi

Language: English - Date: 2016-07-05 06:08:11
64OPTIMIZING PHYLOGENETIC DIVERSITY ACROSS TWO TREES MAGNUS BORDEWICH, CHARLES SEMPLE, AND ANDREAS SPILLNER Abstract. We present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted-su

OPTIMIZING PHYLOGENETIC DIVERSITY ACROSS TWO TREES MAGNUS BORDEWICH, CHARLES SEMPLE, AND ANDREAS SPILLNER Abstract. We present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted-su

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2007-10-09 08:45:20
65Conference Programme 6-10 SeptemberConference Reception (Liverpool Anglican Cathedral) SUNDAY 5 September 2010, 18:30-20:00  ALGO 2010

Conference Programme 6-10 SeptemberConference Reception (Liverpool Anglican Cathedral) SUNDAY 5 September 2010, 18:30-20:00 ALGO 2010

Add to Reading List

Source URL: algo2010.csc.liv.ac.uk

Language: English - Date: 2010-09-02 11:57:06
66From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡

From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡

Add to Reading List

Source URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.com

Language: English - Date: 2012-07-04 18:28:36
67Coarse Matching with Incomplete Information Heidrun C. Hoppe, Benny Moldovanu and Emre Ozdenoren May 1, 2008 Abstract We study two-sided markets with heterogeneous, privately informed agents who gain from

Coarse Matching with Incomplete Information Heidrun C. Hoppe, Benny Moldovanu and Emre Ozdenoren May 1, 2008 Abstract We study two-sided markets with heterogeneous, privately informed agents who gain from

Add to Reading List

Source URL: www.econ2.uni-bonn.de

Language: English - Date: 2014-03-26 06:49:17
68New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School

New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2013-03-14 00:55:15
691  Distributed Optimization With Local Domains: Applications in MPC and Network Flows João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar, and Markus Püschel

1 Distributed Optimization With Local Domains: Applications in MPC and Network Flows João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar, and Markus Püschel

Add to Reading List

Source URL: www.ee.ucl.ac.uk

Language: English - Date: 2015-01-22 05:50:55
70A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta†

A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta†

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2004-09-21 15:30:36